state-transition encoding

См. также в других словарях:

• 8b/10b encoding — In telecommunications, 8b/10b is a line code that maps 8 bit symbols to 10 bit symbols to achieve DC balance (see DC coefficient) and bounded disparity, and yet provide enough state changes to allow reasonable clock recovery. This means that the… …   Wikipedia

• 64b/66b encoding — In data networking and transmission, 64B/66B is a line code that transforms 64 bit data to 66 bit line code to achieve DC balance and bounded disparity, and yet provide enough state changes to allow reasonable clock recovery. This means that… …   Wikipedia

• Manchester encoding —    In communications, a method used to encode data and timing signals in the same transmitted data stream. The signal state during the first half of the bit period indicates its data value (1 is high; 0 is low). A transition to the opposite state …   Dictionary of networking

• кодирование переходом состояний — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN state transition encoding …   Справочник технического переводчика

• Список терминов, относящихся к алгоритмам и структурам данных —   Это служебный список статей, созданный для координации работ по развитию темы.   Данное предупреждение не устанавливается на информационные списки и глоссарии …   Википедия

• Список терминов — Список терминов, относящихся к алгоритмам и структурам данных   Это сл …   Википедия

• List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… …   Wikipedia

• Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized …   Wikipedia

• Viterbi algorithm — The Viterbi algorithm is a dynamic programming algorithm for finding the most likely sequence of hidden states ndash; called the Viterbi path ndash; that results in a sequence of observed events, especially in the context of Markov information… …   Wikipedia

• Hybrid ternary code — The hybrid (H ) ternary line code operates on a hybrid principle that combines the binary non return to zero level (NRZ L) and the polar return to zero (RZ) codes and thus it is called H ternary. The H ternary code has three levels for signal… …   Wikipedia

• Spanning tree protocol — The Spanning Tree Protocol is an OSI layer 2 protocol that ensures a loop free topology for any bridged LAN. It is based on an algorithm invented by Radia Perlman while working for Digital Equipment Corporationcite… …   Wikipedia